On the Line Graph of the Complete Bipartite Graph
نویسندگان
چکیده
منابع مشابه
On Subgraphs of the Complete Bipartite Graph
G(n) denotes a graph of n vertices and G(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let C k (G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k 2 (n) (1) min C (G (n)) + Ck(G(n)) < k k, , ! 2 2 where the minimum is over all graphs G(n). It seems likely that (1)...
متن کاملCluttered orderings for the complete bipartite graph
To minimize the access cost in large disk arrays (RAID) Cohen et al. [5–7] introduced (d, f)-cluttered orderings of various set systems, d, f ∈ N. In case of a graph this amounts to an ordering of the edge set such that the number of points contained in any d consecutive edges is bounded by the number f . For the complete graph, Cohen et al. gave some optimal solution for small parameters d [5]...
متن کاملOn the parameter μ21 of a complete bipartite graph
A proper edge t-coloring of a graph G is a coloring of edges of G with colors 1, 2, ..., t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. An arbitrary nonempty subset of consecutive integers is called an interval. Suppose that all edges of a graph G are colored in the game of Alice a...
متن کاملUniform coverings of 2-paths in the complete graph and the complete bipartite graph
Let G be a graph and H a subgraph of G. A D(G,H, λ) design is a collection D of subgraphs of G each isomorphic to H so that every 2-path (path of length 2) in G lies in exactly λ subgraphs in D. The problem of constructing D(Kn, Cn, 1) designs is the so-called Dudeney’s round table problem. We denote by Ck a cycle on k vertices and by Pk a path on k vertices. In this paper, we construct D(Kn,n,...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1964
ISSN: 0003-4851
DOI: 10.1214/aoms/1177703593